Regular saturated graphs and sum-free sets

In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does n-vertex graph exist. They proved that all sufficiently large n, there K3-saturated with vertices. We extend this result to both K4 K5 prove some partial results larger complete Using variation sum-free sets from additive combinatorics, we k≥2, C2k+1-saturated vertices infinitely many n. Studying give rise graphs an interesting problem on its own state open in direction.